|
|
Regulated Parsing
Wolf, Dominik ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work deals with advanced models of context-free grammars and explores the possibilities of adaptation and usefulness for deterministic parsing of non-context-free sructures by deep parsing method. It introduces adapted model of context-free grammar named LL programmed grammar and adapted deep pushdown automaton that makes deterministic parsing of non-context-free structures possible.
|
|
| |
|
|
Pushdown Systems and Parsing Based on Them
Křesťan, Zdeněk ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis focuses on the use of deep pushdown automaton in parsing . This method overcomes the power of traditional context - free grammars . The predictive parsing algorithm, driven by LL table, is modified by the use of deep pushdown automaton . The modifications extended LL tables by adding depth , in order for tables to collaborate with the deep pushdown automaton .
|
|
|
Parsing Based on Matrix Grammars
Bednář, Petr ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis is researching parsing based on matrix grammars. Introduces automata controled parsing method. It discusses problems of deterministic parsing of matrix grammars. Thesis is focusing on deterministic parsing of non-deterministic languages. It studies strength of this deterministic method.
|
|
| |
|
|
Parsing Based on Matrix Grammars
Bednář, Petr ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis is researching parsing based on matrix grammars. Introduces automata controled parsing method. It discusses problems of deterministic parsing of matrix grammars. Thesis is focusing on deterministic parsing of non-deterministic languages. It studies strength of this deterministic method.
|
|
|
Regulated Parsing
Wolf, Dominik ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work deals with advanced models of context-free grammars and explores the possibilities of adaptation and usefulness for deterministic parsing of non-context-free sructures by deep parsing method. It introduces adapted model of context-free grammar named LL programmed grammar and adapted deep pushdown automaton that makes deterministic parsing of non-context-free structures possible.
|
|
|
Pushdown Systems and Parsing Based on Them
Křesťan, Zdeněk ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis focuses on the use of deep pushdown automaton in parsing . This method overcomes the power of traditional context - free grammars . The predictive parsing algorithm, driven by LL table, is modified by the use of deep pushdown automaton . The modifications extended LL tables by adding depth , in order for tables to collaborate with the deep pushdown automaton .
|
guest ::
